On decompositions of multivariate functions

نویسندگان

  • Frances Y. Kuo
  • Ian H. Sloan
  • Grzegorz W. Wasilkowski
  • Henryk Wozniakowski
چکیده

We present formulas that allow us to decompose a function f of d variables into a sum of 2d terms fu indexed by subsets u of {1, . . . , d}, where each term fu depends only on the variables with indices in u. The decomposition depends on the choice of d commuting projections {Pj}j=1, where Pj(f) does not depend on the variable xj . We present an explicit formula for fu, which is new even for the anova and anchored decompositions; both are special cases of the general decomposition. We show that the decomposition is minimal in the following sense: if f is expressible as a sum in which there is no term that depends on all of the variables indexed by the subset z then, for every choice of {Pj}j=1, the terms fu = 0 for all subsets u containing z. Furthermore, in a reproducing kernel Hilbert space setting, we give sufficient conditions for the terms fu to be mutually orthogonal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multivariate periodic wavelet analysis

General multivariate periodic wavelets are an efficient tool for the approximation of multidimensional functions, which feature dominant directions of the periodicity. One-dimensional shift invariant spaces and tensor-product wavelets are generalized to multivariate shift invariant spaces on non-tensor-product patterns. In particular, the algebraic properties of the automorphism group are inves...

متن کامل

Uncertainty Quantification by Alternative Decompositions of Multivariate Functions

This article advocates factorized and hybrid dimensional decompositions (FDD/HDD), as alternatives to analysis-of-variance dimensional decomposition (ADD), for second-moment statistical analysis of multivariate functions. New formulas revealing the relationships between component functions of FDD and ADD are proposed. While ADD or FDD is relevant when a function is strongly additive or strongly...

متن کامل

Some Results on the Functional Decomposition of Polynomials

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f , determine the existence of such functions g and h. In this thesis we consider functional decompositions of univariate and multivariate polynomials, and rational functions over a field F of characteristic p. In the polynomial case, “wild” behaviour occurs in both ...

متن کامل

COVARIANCE MATRIX OF MULTIVARIATE REWARD PROCESSES WITH NONLINEAR REWARD FUNCTIONS

Multivariate reward processes with reward functions of constant rates, defined on a semi-Markov process, first were studied by Masuda and Sumita, 1991. Reward processes with nonlinear reward functions were introduced in Soltani, 1996. In this work we study a multivariate process , , where are reward processes with nonlinear reward functions respectively. The Laplace transform of the covar...

متن کامل

Extended Linear Models, Multivariate Splines and Anova

Extended Linear Models, Multivariate Splines and ANOVA by Mark Henry Hansen Doctor of Philosophy in Statistics University of California at Berkeley Professor Charles J. Stone, Chair In this dissertation, we pursue a theoretical investigation into several aspects of multivariate function estimation. In general, we con ne ourselves to estimators that are smooth, piecewise polynomial functions, or...

متن کامل

Algebraic Algorithms

This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRCPress/Taylor and Francis Group. Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2010